On Löwenheim-Skolem-Tarski numbers for extensions of first order logic∗
نویسندگان
چکیده
We show that, assuming the consistency of a supercompact cardinal, the first (weakly) inaccessible cardinal can satisfy a strong form of a Löwenheim-Skolem-Tarski theorem for the equicardinality logic L(I), a logic introduced in [4] strictly between first order logic and second order logic. On the other hand we show that in the light of present day inner model technology, nothing short of a supercompact cardinal suffices for this result. In particular, we show that the LöwenheimSkolem-Tarski theorem for the equicardinality logic at κ implies the Singular Cardinals Hypothesis above κ as well as Projective Determinacy.
منابع مشابه
The Emergence of First - Order Logic
To most mathematical logicians working in the 1980s, first-order logic is the proper and natural framework for mathematics. Yet it was not always so. In 1923, when a young Norwegian mathematician named Thoralf Skolem argued that set theory should be based on first-order logic, it was a radical and unprecedented proposal. The radical nature of what Skolem proposed resulted, above all, from its e...
متن کاملOn the compactness property of extensions of first-order G"{o}del logic
We study three kinds of compactness in some variants of G"{o}del logic: compactness,entailment compactness, and approximate entailment compactness.For countable first-order underlying language we use the Henkinconstruction to prove the compactness property of extensions offirst-order g logic enriched by nullary connective or the Baaz'sprojection connective. In the case of uncountable first-orde...
متن کاملA New Löwenheim-skolem Theorem
This paper establishes a refinement of the classical LöwenheimSkolem theorem. The main result shows that any first order structure has a countable elementary substructure with strong second order properties. Several consequences for Singular Cardinals Combinatorics are deduced from this.
متن کاملSkolem Functions and Equality in Automated Deduction
We present a strategy for restricting the application of the inference rule paramodulation. The strategy applies to problems in first-order logic with equality and is designed to prevent paramodulation into subterms of Skolem expressions. A weak completeness result is presented (the functional reflexive axioms are assumed). Experimental results on problems in set theory, combinatory logic, Tars...
متن کاملModel-Theoretic Constructions in Fuzzy Logic with Evaluated Syntax
This paper studies the model theory as generalization of classical model theory in predicate fuzzy logic with evaluated syntax (Ev L ). There exist a lot of possibilities how to find the models of fuzzy theories. In this paper we will describe the theoretic constructions of the models in Ev L where these models are built by using elementary extensions and downward Löwenheim-Skolem-Tarski theore...
متن کامل